Problem reduction heuristic for the 0―1 multidimensional knapsack problemHILL, Raymond R; YONG KUN CHO; MOORE, James T et al.Computers & operations research. 2012, Vol 39, Num 1, pp 19-26, issn 0305-0548, 8 p.Article

Dominating set based exact algorithms for 3-coloringNARAYANASWAMY, N. S; SUBRAMANIAN, C. R.Information processing letters. 2011, Vol 111, Num 6, pp 251-255, issn 0020-0190, 5 p.Article

The indexing for one-dimensional proportionally-scaled stringsPENG, Yung-Hsing; YANG, Chang-Biau; TSENG, Chiou-Ting et al.Information processing letters. 2011, Vol 111, Num 7, pp 318-322, issn 0020-0190, 5 p.Article

A clique-covering sufficient condition for hamiltonicity of graphsBRETTO, Alain; VALLEE, Thierry.Information processing letters. 2009, Vol 109, Num 20, pp 1156-1160, issn 0020-0190, 5 p.Article

Spatial joins based on NA-treesCHEN, Hue-Ling; CHANG, Ye-In.Information processing letters. 2009, Vol 109, Num 13, pp 713-718, issn 0020-0190, 6 p.Article

k-Restricted rotation distance between binary treesLUCCIO, Fabrizio; ENRIQUEZ, Antonio Mesa; PAGLI, Linda et al.Information processing letters. 2007, Vol 102, Num 5, pp 175-180, issn 0020-0190, 6 p.Article

Uniform metrical task systems with a limited number of statesBEIN, Wolfgang; LARMORE, Lawrence L; NOGA, John et al.Information processing letters. 2007, Vol 104, Num 4, pp 123-128, issn 0020-0190, 6 p.Article

A filtering algorithm for k-mismatch with don't caresCLIFFORD, Raphaël; PORAT, Ely.Information processing letters. 2010, Vol 110, Num 22, pp 1021-1025, issn 0020-0190, 5 p.Article

Finding the longest common nonsuperstring in linear timeJOONG CHAE NA; DONG KYUE KIM; JEONG SEOP SIM et al.Information processing letters. 2009, Vol 109, Num 18, pp 1066-1070, issn 0020-0190, 5 p.Article

Sensitivity and specificity based multiobjective approach for feature selection: Application to cancer diagnosisGARCIA-NIETO, J; ALBA, E; JOURDAN, L et al.Information processing letters. 2009, Vol 109, Num 16, pp 887-896, issn 0020-0190, 10 p.Article

A fast and simple algorithm for computing the longest common subsequence of run-length encoded stringsANN, Hsing-Yen; YANG, Chang-Biau; TSENG, Chiou-Ting et al.Information processing letters. 2008, Vol 108, Num 6, pp 360-364, issn 0020-0190, 5 p.Article

Asymmetric k-center with minimum coverageLI GØRTZ, Inge.Information processing letters. 2008, Vol 105, Num 4, pp 144-149, issn 0020-0190, 6 p.Article

Optimal implementations of UPGMA and other common clustering algorithmsGRONAU, Ilan; MORAN, Shlomo.Information processing letters. 2007, Vol 104, Num 6, pp 205-210, issn 0020-0190, 6 p.Article

A simple algorithm for in-place mergingCHEN, Jing-Chao.Information processing letters. 2006, Vol 98, Num 1, pp 34-40, issn 0020-0190, 7 p.Article

Fast leader election in anonymous rings with bounded expected delayBAKHSHI, Rena; ENDRULLIS, Jörg; FOKKINK, Wan et al.Information processing letters. 2011, Vol 111, Num 17, pp 864-870, issn 0020-0190, 7 p.Article

Efficient algorithms for the block-edit problemsANN, Hsing-Yen; YANG, Chang-Biau; PENG, Yung-Hsing et al.Information and computation (Print). 2010, Vol 208, Num 3, pp 221-229, issn 0890-5401, 9 p.Article

The Floyd-Warshall algorithm on graphs with negative cyclesHOUGARDY, Stefan.Information processing letters. 2010, Vol 110, Num 8-9, pp 279-281, issn 0020-0190, 3 p.Article

A closed-form solution to video matting of natural snowHAI LIU; LIZHUANG MA; XUAN CAI et al.Information processing letters. 2009, Vol 109, Num 18, pp 1097-1104, issn 0020-0190, 8 p.Article

Gray codes for reflectable languagesYUE LI; SAWADA, Joe.Information processing letters. 2009, Vol 109, Num 5, pp 296-300, issn 0020-0190, 5 p.Article

Optimally competitive list batchingBEIN, Wolfgang; EPSTEIN, Leah; LARMORE, Lawrence L et al.Theoretical computer science. 2009, Vol 410, Num 38-40, pp 3631-3639, issn 0304-3975, 9 p.Article

Fast exact string matching algorithmsLECROQ, Thierry.Information processing letters. 2007, Vol 102, Num 6, pp 229-235, issn 0020-0190, 7 p.Article

Computing Longest Previous Factor in linear time and applicationsCROCHEMORE, Maxime; ILIE, Lucian.Information processing letters. 2008, Vol 106, Num 2, pp 75-80, issn 0020-0190, 6 p.Article

Should one always use repeated squaring for modular exponentiation?KLEIN, Shmuel T.Information processing letters. 2008, Vol 106, Num 6, pp 232-237, issn 0020-0190, 6 p.Article

Dynamic programming algorithms for the mosaic longest common subsequence problemHUANG, Kuo-Si; YANG, Chang-Biau; TSENG, Kuo-Tsung et al.Information processing letters. 2007, Vol 102, Num 2-3, pp 99-103, issn 0020-0190, 5 p.Article

Linear-time algorithms for problems on planar graphs with fixed disk dimensionABU-KHZAM, Faisal N; LANGSTON, Michael A.Information processing letters. 2007, Vol 101, Num 1, pp 36-40, issn 0020-0190, 5 p.Article